Euler Characteristics of Complete Intersections
نویسندگان
چکیده
منابع مشابه
Euler Characteristic of Real Nondegenerate Tropical Complete Intersections
We define nondegenerate tropical complete intersections imitating the corresponding definition in complex algebraic geometry. As in the complex situation, all nonzero intersection multiplicity numbers between tropical hypersurfaces defining a nondegenerate tropical complete intersection are equal to 1. The intersection multiplicity numbers we use are sums of mixed volumes of polytopes which are...
متن کاملCriteria for complete intersections
We establish two criteria for certain local algebras to be complete intersections. These criteria play an important role in A. Wiles’s proof that all semi-stable elliptic curves over Q are modular. Introduction In this paper we discuss two results in commutative algebra that are used in A. Wiles’s proof that all semi-stable elliptic curves over Q are modular [11]. We first fix some notation tha...
متن کاملElliptic Genera of Complete Intersections
We propose a new definition of the elliptic genera for complete intersections, not necessarily nonsingular, in projective spaces. We also prove they coincide with the expressions obtained from Landau-Ginzburg model by an elementary argument.
متن کاملHodge Numbers of Complete Intersections
Suppose X is a compact Kähler manifold of dimension n and E is a holomorphic vector bundle. For every p ≤ dim C X we have a sheaf Ω p (E) whose sections are holomorphic (p, 0)-forms with coefficients in E. We set and we define the holomorphic Euler characteristics χ p (X, E) := q≥0 (−1) q h p,q (X, E). It is convenient to introduce the generating function of these numbers χ y (X, E) := p≥0 y p ...
متن کاملFootprint functions of complete intersections
We study the minimum distance function of a complete intersection graded ideal in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection, we use the footprint function to give a sharp lower bound for the minimum distance function. Then we show some applications to coding theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.2307/2041645